Weave-realizability for D–type
نویسندگان
چکیده
We study exact Lagrangian fillings of Legendrian links $D_n$-type in the standard contact 3-sphere. The main result is existence a filling, represented by weave, such that any algebraic quiver mutation associated intersection can be realized as geometric weave mutation. method proof via calculus and construction appropriate 1-cycles whose intersections realize required numbers. In particular, we show $D$-type, each cluster chart moduli microlocal rank-1 sheaves induced at least one embedded filling. Hence, have many Hamiltonian isotopy classes seeds algebra, their exchange graph for disk surgeries contains $D_n$-type.
منابع مشابه
Realizability for programming languages
We present a toy functional programming language inspired by our work on the PML language [22] together with a criterion ensuring safety and the fact that non termination can only occur via recursive programs. To prove this theorem, we use realizability techniques and a semantical notion of types. Important features of PML like polymorphism, proof-checking, termination criterion for recursive f...
متن کاملSheaf toposes for realizability
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms to study the relationship between realizability models over different partial combinatory algebras. This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction o...
متن کاملDiagnostic Information for Realizability
Realizability – checking whether a specification can be implemented by an open system – is a fundamental step in the design flow. However, if the specification turns out not to be realizable, there is no method to pinpoint the causes for unrealizability. In this paper, we address the open problem of providing diagnostic information for realizability: we formally define the notion of (minimal) e...
متن کاملTo Weave the Web
The paper discusses the issue of views in the Web context. We introduce a set of languages for managing and restructuring data coming from the World Wide Web. We present a specific data model, called the ARANEUS Data Model, inspired to the structures typically present in Web sites. The model allows us to describe the scheme of a Web hypertext, in the spirit of databases. Based on the data model...
متن کاملHow to Weave?
In order to present our point of view on AOP, we start from the basics of computing and the concept of program. A given program P can always be viewed as a sequence of statements that are aimed to produce some result R. By result, we mean any kind of outcome (a calculation, a display...). This result R is obtained through the execution of the program P. This execution is done by some platform (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic & Geometric Topology
سال: 2023
ISSN: ['1472-2739', '1472-2747']
DOI: https://doi.org/10.2140/agt.2023.23.2735